The Decidability of -Pushing PDA

Dividing Line between Decidable PDA's and Undecidable Ones

Sénizergues has proved that language equivalence is decidable for disjoint ǫ-deterministic PDA. Stirling has showed that strong bisimilarity is decidable for PDA. On the negative side Srba demonstrated that the weak bisimilarity is undecidable for normed PDA. Later Jančar and Srba established the undecidability of the weak bisimilarity for disjoint ǫ-pushing PDA and disjoint ǫ-popping PDA. Thes...

Note on Undecidability of Bisimilarity for Second-Order Pushdown Processes

Broadbent and Göller (FSTTCS 2012) proved the undecidability of bisimulation equivalence for processes generated by ε-free second-order pushdown automata. We add a few remarks concerning the used proof technique, called Defender’s forcing, and the related undecidability proof for first-order pushdown automata with ε-transitions (Jančar and Srba, JACM 2008). Language equivalence of pushdown auto...

Decidability and Tameness in the Theory of Finite Semigroups

Planar Molecular Dynamics Simulation of Au Clusters in Pushing Process

Based on the fact the manipulation of fine nanoclusters calls for more precise modeling, the aim of this paper is to conduct an atomistic investigation for interaction analysis of particle-substrate system for pushing and positioning purposes. In the present research, 2D molecular dynamics simulations have been used to investigate such behaviors. Performing the planar simulations can provide a ...

Comparison of managed and spontaneous maternal pushing, on pain and duration of the second stage of labor in primipara women

Background & Aim: Despite the complications of the Managing active second stage delivery, this method is still used. In recent studies, it seems that Spontaneous pushing will reduce the Complications of delivery. Therefore, this study examines pain and duration of the second stage of labor in these two methods. Methods: This single blind semi experimental study was accomplished on 60 qualified...